A Method to Deduce and Synthesize the Dafny Programs

We propose a systematic method to deduce and synthesize the Dafny programs. First, specification of problem is described in strict mathematical language. Then, derivation process uses program transformation technology perform equivalent transformation. Furthermore, synthesized through obtained recursive relationship loop invariants. Finally, functional correctness automatically verified by verifier or online tool. Through this method, we programs for many typical problems such as cube sum problem, minimum (or maximum) contiguous subarray problems, several searching sorting so on. Due space limitation, only illustrate development two problems: new local bubble problem. It proves that our can effectively improve reliability developed. What’s more, demonstrate potential deductive synthesis developing Sorting program.